Methods and apparatus for protecting against overload conditions on nodes of a distributed network

ABSTRACT

Methods and apparatus for protecting against and/or responding to an overload condition at a node (“victim”) in a distributed network divert traffic otherwise destined for the victim to one or more other nodes, which can filter the diverted traffic, passing a portion of it to the victim, and/or effect processing of one or more of the diverted packets on behalf of the victim. Diversion can be performed by one or more nodes (collectively, a “first set” of nodes) external to the victim. Filtering and/or effecting traffic processing can be performed by one or more nodes (collectively, a “second set” of nodes) also external to the victim. Those first and second sets can have zero, one or more nodes in common—or, put another way, they may wholly, partially or not overlap. The methods and apparatus have application in protecting nodes in a distributed network, such as the Internet, against distributed denial of service (DDoS) attacks.

[0001] This application claims the benefit of U.S. Provisional Patent Application Serial No. 60/240,899, filed Oct. 17, 2000, and entitled “Distributed Network Defense System,” the teachings of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

[0002] The invention pertains to distributed data networks and, more particularly, protecting against overload conditions at nodes of such networks. It has application, by way of non-limiting example, in protecting servers, sites and other elements of networks, such as the Internet and the like, from distributed denial of service (DDoS) attacks and flash crowds.

[0003] Early computer systems were typically stand-alone devices that processed only commands and data entered via dedicated local keyboards, tape drives, disk drives, card readers, or the like. Remote access was possible, but only via phone lines and modems, which essentially served as surrogates or proxies to remote users' keyboards. By the early 1980's, a national network had been developed for carrying data communications between university, defense department and other large computer systems. This early Internet (known then as the ARPANET), which relied on a mix of dedicated lines and modems, was inaccessible to the public at large and, hence, subject to outages and espionage but, for the most part, not wide scale attack from “hackers.”

[0004] Through the 1990's, that national network expanded around the globe adding millions of governmental, research and commercial nodes. The latter included so-called Internet service providers (ISPs) that afforded low-cost access to the masses. People being as they are, this included a mischievous if not downright scurrilous element intent—at least insofar as their time, resources and interests permitted—on blocking access to popular nodes (or “sites”) on the network. The most insidious form of this cybervandalism is the distributed denial of service (DDoS) attack, in which the computers that service requests coming in to a node are swamped by millions of fake requests that may seem to come from many sources but, ultimately, emanate from a few hackers' computers.

[0005] Despite numerous DDoS attacks that have taken place over the past few years, with a surge of attacks on YAHOO, CNN, and many other major sites, there is still no known online solution for defense against them.

[0006] In view of the foregoing, an object of this invention is to provide improved distributed data networks and methods of operation thereof. A related object of the invention is to provide improved nodes, devices and methods of operation thereof for use on such distributed data networks.

[0007] Further related objects are to provide such improved data networks, nodes, devices and methods of operation thereof that provide enhanced protection from overload conditions, malicious, legitimate or otherwise.

[0008] A still further related object is to provide such improved data networks, nodes, devices and methods of operation thereof that provide enhanced protection from DDoS attacks.

[0009] Yet a still further object of the invention is to provide such improved data networks, nodes, devices and methods of operation thereof as can be used in existing networks, such as the Internet, as well as in other networks.

[0010] Yet a still further object of the invention is to provide data networks, nodes, devices and methods of operation thereof as can be implemented at low cost and are scalable.

SUMMARY OF THE INVENTION

[0011] These and other objects of the invention are attained by the invention, which provides, in one aspect, a method of protecting against an overload condition at a site, server or other network element (victim) in a set of potential victims disposed on a distributed network. The method includes using a first set of one or more network elements (which may, for example, already reside on the network) to selectively divert to a second set of one or more other network elements traffic otherwise destined for the victim. The element(s) of the second set filter the diverted traffic, selectively passing a portion of it to the victim. In diverting the traffic, the elements of the first set cause it to take a path that differs from the path it would otherwise take (in absence of such diversion). Thus, for example, rather than permitting the traffic to continue in its normal nodal path to the victim, a method according to this aspect of the invention effects redirection of the traffic to the element or elements of the second set, from which it may be rerouted back to the victim (e.g., after filtering and/or partial processing).

[0012] Still further aspects of the invention provide methods as described above in which elements of the first set are disposed at points around a region that may be referred to as a “protected area.” Element(s) of the second set can be disposed external to the elements of the first set or may be adjacent with it, for example co-residing in the same network elements or nodes.

[0013] Further aspects of the invention provide methods as described above in which each potential victim is associated with at least two IP addresses, e.g., one by which the victim is publicly known (e.g., via the DNS system) and another by which the victim is privately known (e.g., only by elements of the second set or other select nodes within the protected area). According to these aspects of the invention, filtering can be effected by diverting all traffic destined to the first (public) address to elements of the second set and passing traffic to victim, only from those elements, using the second (private) address.

[0014] In related aspects, the invention provides methods as described above in which elements of the first set are selectively actuable to provide diversion, e.g., in response to DDoS attacks or other overload conditions. Diversion can be effected, by way of example, by declaring that the victim's public address is reachable through elements of the second set (or, put another way, that the public address is close in network distances to those elements). Alternatively or in addition, such diversion can be effected declaring that the public address is far away (in network distance) from the victim.

[0015] Yet still further aspects of the invention provide methods as described above in which diversion is effected by redirecting traffic as a function of an interface on which it was received, e.g., by routers or other elements of the first set (e.g., using Policy Based Routing of Cisco).

[0016] In further related aspects of the invention, diversion is effected using the WCCP (Web Cache Coordination Protocol) version 2 and, more particularly, for example, using Layer 2 destination address rewrite and/or GRE (Generic Routing Encapsulation), to route to elements of the second set traffic otherwise destined for the victim (as if the elements of the second set were web caching machines contemplated by WCCP). Packets that return from those elements can be routed onward to the victim using routing tables, e.g., in the elements of the first set that had diverted the traffic in the first instance or in (other) routers disposed between the elements of the second set and the victim.

[0017] Diversion can also be effected, according to still further aspects of the invention, through issuance of BGP announcements to cause traffic otherwise destined for the victim to be routed to the elements of the second set, and through use of Policy Based Routing (PBR) to effect routing of traffic from the second set of elements onward to the victim (e.g., via the corresponding elements of the first set).

[0018] In still further related aspects, diversion can be effected—e.g., at entrances to data centers or hosting centers—through use of BGP to cause traffic otherwise destined for the victim to be routed to elements of the second set, and through use of MAC or other layer 2 addresses to effect routing of traffic from the second set of elements onward to the victim.

[0019] Further aspects of the invention provide methods as described above in which the filtering of the diverted traffic by the second set of nodes includes detecting suspected malicious traffic. This can be, for example, traffic from selected origination points, e.g., those of a suspected hacker. It can also be traffic with spoofed origination or spoofed routing addresses.

[0020] Still further aspects of the invention provide methods as described above where filtering includes detecting traffic requiring a selected service from victim. Depending on the type of victim, this can be used by way of non-limiting example to pass to the victim only those packets which require the victim's specific services. Traffic requiring other services can be blocked, or handled by a network element of the second set.

[0021] By way of example, if the victim is an e-commerce site, packets involving customer orders can be passed to it by network elements of the second set. Other packets, such as UDP and ICMP can be discarded. If the service provided by the victim are different, such as a mail server or IRC, then the corresponding packets can be passed to the victim, while others that are not required by the victim can be discarded.

[0022] Other aspects of the invention provide methods as described above where the filtering includes at least partially processing the diverted traffic. This can include, for example, executing a verification protocol on behalf the victim (e.g., performing a three-way handshake with a source or querying it to require human input) in order to insure that any traffic passed to it is from legitimate sources and not, for example, potentially malicious. According to further aspects of the invention, partial processing can include storing and/or updating a “cookie” at a site that originated diverted traffic. It can also include modifying such a traffic to direct or redirect it to an alternate URL associated with the victim.

[0023] According to some aspects of the processing performed by the network elements of the second set is performed in the name of the victim, e.g., insofar as at least casual users at the sources are concerned. Other such processing is performed in place of processing by the victim, regardless of whether such users can discern the identity of the element that performed the processing.

[0024] In further related aspects of the invention, the elements of the second set can respond to traffic otherwise destined for the victim by (i) forwarding those packets onward toward the victim (unmodified, modified, pre-processed, verified, or otherwise), (ii) generating further packets for routing toward the victim or other elements and/or nodes on the network (e.g., for purposes of verification, further processing, or otherwise). In either case, routing of the forwarded or generated packets can be effected using the same techniques as those described above in connection with the forwarding of diverted packets from the elements of the second set to the victim. By way of example, packets generated by elements of the second set can be addressed by those elements to the victim or other nodes and can be forwarded thereto using routing tables, PBR, MAC or other Layer 2 addressing, among other mechanisms.

[0025] Still further aspects of the invention provide methods as described above in which one or more elements of the second set direct diverted traffic to still other network elements external to the victim, which other elements can perform full or partial processing on behalf of the victim (one possibility of which is acting as a distributed set of reverse proxies).

[0026] In still other aspects, the invention provides methods as described above in which the elements of the first set perform filtering, as well. This can include, by way of non-limiting example, comparing the source addresses of traffic against the interfaces on which that traffic is received. It can further include sampling traffic that arrives on network interfaces, tracking changes in its paths and/or interrogating sources of that traffic to validate legitimacy.

[0027] Yet still further aspects of the invention provide methods as described above in which the filtering step includes detecting differences in traffic patterns on the network. This can include recording network flow, server logs or the like to discern traffic volume, port number distribution, periodicity of requests, packet properties, IP geography, distribution of packet arrival/size, and/or other aspects of potential victim traffic when the victim or set of potential victims is/are not overloaded. Moreover, it can include monitoring these (or other) aspects of victim traffic at the onset or during an overload condition, such as a DDoS attack. Victim and potential victim traffic can be classified, according to related aspects of the invention, by their source types, e.g., whether they arise from individual users, plural users sharing host or proxy, web crawlers, monitoring servers, and so forth.

[0028] The filtering step, according to these and other aspects, includes comparing traffic patterns when system is under an overload condition with expected such, e.g., patterns from a prior period. Such comparison can include identifying changes that differ in a statistically significant way from expectation or historical patterns.

[0029] Further aspects of the invention provide methods as described above in which one or more elements generate rules for filtering further network traffic. These rules, which can be carried out by the elements of the first or second sets, can specify netflows to filter and duration for filtering.

[0030] Methods according to the aforementioned aspects of the invention can include detecting the attack, or putative attack, with the elements of the first set, the second set, or the victim, itself. Moreover, utilizing the techniques described above, diverting and/or filtering can be effected selectively, e.g., on request of the victim (or another node) that detects the attack.

[0031] Still further aspects of the invention provide nodes and devices, such as routers, switches, servers and other devices, operating in accord with the methods described above. For example, an element of the second set can include an input that receives traffic from network and an output that passes filtered traffic to a victim, e.g., via the network. A filter module blocks traffic from sources suspected as potentially causing the overload condition and is coupled to a statistical element that identifies such sources using statistics.

[0032] Such an apparatus can additionally include a module for detecting termination of the overload condition. Moreover, according to further aspects of the invention, it can include functionality that transmits to further elements on the network, e.g., those of the first set that operate an ingress filter, rules for blocking traffic. An antispoofing element, moreover, can prevent sources of malicious traffic from generating packets with spoofed source IP addresses.

[0033] Still further aspects of the invention are evident in the claims-like description of the invention that follows:

[0034] 1. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims on a network, the method comprising the steps of

[0035] A. with a first set of one or more network elements external to the set of one or more potential victims, diverting to a second set of one or more network elements external to the set of one or more potential victims traffic otherwise destined for the victim,

[0036] B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim.

[0037] 2. A method according to claim 1, wherein the diverting step includes effecting a path of traffic that differs from a path that traffic would otherwise take to the victim.

[0038] 3. A method according to claim 1, wherein

[0039] the filtering step includes detecting any of (i) a traffic pattern that differs from an expected pattern and (ii) traffic volume that differ from expected volume,

[0040] the detecting step includes determining whether any of the traffic pattern and volume varies statistically significantly.

[0041] 4. A method according to claim 1, wherein the filtering step includes detecting suspected malicious traffic.

[0042] 5. A method according to claim 4, wherein the detecting step includes detecting packets with spoofed source addresses.

[0043] 6. A method according to claim 5, wherein the filtering step includes detecting traffic requiring a selected service from the victim.

[0044] 7. A method according to claim 6, wherein the filtering step includes discarding traffic not requiring the selected service from the victim.

[0045] 8. A method according to claim 7, wherein the filtering step includes discarding any of UDP and ICMP packet traffic.

[0046] 9. A method according to any of claims 1-8, wherein the first set and second set include zero, one or more network elements in common.

[0047] 10. A method according to any of claims 1-8, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.

[0048] 11. A method according to claim 10, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.

[0049] 12. A method according to claim 10, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.

[0050] 13. A method according to claim 12, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.

[0051] 14. A method according to claim 12, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.

[0052] 15. A method according to claim 12, comprising

[0053] associating victim with first and second addresses, and wherein the

[0054] filtering step includes

[0055] discarding traffic received external to an area defined by the points directed to the first address, and

[0056] passing traffic to the victim traffic received external to an area directed to the second address.

[0057] 16. A method according to claim 10, wherein the diverting step includes redirecting traffic using Policy Based Routing.

[0058] 17. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of

[0059] A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim,

[0060] B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim,

[0061] C. the filtering step including detecting packets with spoofed source addresses by at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0062] 18. A method according to claim 17, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0063] 19. A method according to claim 18, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0064] 20. A method according to claim 18, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0065] 21. A method according to any of claims 17-20, wherein the detecting step includes detecting traffic requiring a selected service from the victim.

[0066] 22. A method according to claim 21, wherein the filtering step includes discarding traffic not requiring the selected service from the victim.

[0067] 23. A method according to claim 22, wherein the filtering step includes discarding any of UDP and ICMP packet traffic.

[0068] 24. A method according to any of claims 17-20, wherein the first set and second set include zero, one or more network elements in common.

[0069] 25. A method according to any of claims 17-20, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.

[0070] 26. A method according to claim 25, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.

[0071] 27. A method according to claim 25, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.

[0072] 28. A method according to claim 27, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.

[0073] 29. A method according to claim 27, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.

[0074] 30. A method according to claim 27, comprising

[0075] associating victim with first and second addresses, and wherein the

[0076] filtering step includes

[0077] discarding traffic received external to an area defined by the points directed to the first address, and

[0078] passing traffic to the victim traffic received external to an area directed to the second address.

[0079] 31. A method according to claim 25, wherein the diverting step includes redirecting traffic using Policy Based Routing.

[0080] 32. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of

[0081] A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim,

[0082] B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim,

[0083] C. the filtering step including at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0084] 33. A method according to claim 32, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0085] 34. A method according to claim 33, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0086] 35. A method according to claim 33, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0087] 36. A method according to any of claims 32-35, wherein the filtering step includes detecting traffic requiring a selected service from the victim.

[0088] 37. A method according to claim 36, wherein the filtering step includes discarding traffic not requiring the selected service from the victim.

[0089] 38. A method according to claim 37, wherein the filtering step includes discarding any of UDP and ICMP packet traffic.

[0090] 39. A method according to any of claims 32-35, wherein the first set and second set include zero, one or more network elements in common.

[0091] 40. A method according to any of claims 32-35, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.

[0092] 41. A method according to claim 40, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.

[0093] 42. A method according to claim 40, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.

[0094] 43. A method according to claim 42, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.

[0095] 44. A method according to claim 42, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.

[0096] 45. A method according to claim 42, comprising

[0097] associating victim with first and second addresses, and wherein the

[0098] filtering step includes

[0099] discarding traffic received external to an area defined by the points directed to the first address, and

[0100] passing traffic to the victim traffic received external to an area directed to the second address.

[0101] 46. A method according to claim 40, wherein the diverting step includes redirecting traffic using Policy Based Routing.

[0102] 47. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of

[0103] A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim,

[0104] B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim,

[0105] C. the filtering step including discarding traffic of selected type.

[0106] 48. A method according to claim 47, wherein the filtering step includes discarding any of UDP and ICMP packet traffic.

[0107] 49. A method according to any of claims 47-48, wherein the filtering step includes detecting traffic requiring a selected service from the victim.

[0108] 50. A method according to claim 49, wherein the filtering step includes discarding traffic not requiring the selected service from the victim.

[0109] 51. A method according to any of claims 47-48, wherein the filtering step includes at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0110] 52. A method according to claim 51, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0111] 53. A method according to claim 52, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0112] 54. A method according to claim 52, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0113] 55. A method according to any of claims 47-48, wherein the first set and second set include zero, one or more network elements in common.

[0114] 56. A method according to any of claims 47-48, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.

[0115] 57. A method according to claim 56, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.

[0116] 58. A method according to claim 56, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.

[0117] 59. A method according to claim 58, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.

[0118] 60. A method according to claim 58, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.

[0119] 61. A method according to claim 58, comprising

[0120] associating victim with first and second addresses, and wherein the

[0121] filtering step includes

[0122] discarding traffic received external to an area defined by the points directed to the first address, and

[0123] passing traffic to the victim traffic received external to an area directed to the second address.

[0124] 62. A method according to claim 56, wherein the diverting step includes redirecting traffic using Policy Based Routing.

[0125] 63. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of

[0126] A. with a first set of one or more elements external to the set of one or more potential victims, performing a first filtering of traffic destined for the victim and diverting to a second set of one or more elements external to the set of one or more potential victims at least a portion of that traffic,

[0127] B. the element(s) of the second set performing a second filtering of traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim

[0128] 64. A method according to claim 63, wherein the first filtering step includes checking an address of traffic against a network interface through which it is received.

[0129] 65. A method according to claim 64, comprising tracking changes in traffic paths.

[0130] 66. A method according to claim 65, comprising sampling traffic that arrives on network interfaces.

[0131] 67. A method according to claim 65, comprising querying apparent sources of traffic to validate legitimacy.

[0132] 68. A method according to any of claims 63-67, wherein the second filtering step includes detecting suspected malicious traffic.

[0133] 69. A method according to claim 68, wherein the detecting step includes detecting packets with spoofed source addresses.

[0134] 70. A method according to claim 69, wherein the second filtering step includes detecting traffic requiring a selected service from the victim.

[0135] 71. A method according to claim 70, wherein the second filtering step includes discarding traffic not requiring the selected service from the victim.

[0136] 72. A method according to claim 71, wherein the second filtering step includes discarding any of UDP and ICMP packet traffic.

[0137] 73. A method according to any of claims 63-67, wherein the second filtering step including detecting packets with spoofed source addresses by at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0138] 74. A method according to claim 73, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0139] 75. A method according to claim 74, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0140] 76. A method according to claim 74, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0141] 77. A method according to any of claims 63-67, the second filtering step including at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0142] 78. A method according to claim 77, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0143] 79. A method according to claim 78, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0144] 80. A method according to claim 78, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0145] 81. A method according to any of claims 63-67, the second filtering step including discarding traffic of selected type.

[0146] 82. A method according to claim 81, wherein the second filtering step includes discarding any of UDP and ICMP packet traffic.

[0147] 83. A method according to any of claims 63-67, wherein the first set and second set include zero, one or more network elements in common.

[0148] 84. A method according to any of claims 63-67, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.

[0149] 85. A method according to claim 84, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.

[0150] 86. A method according to claim 84, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.

[0151] 87. A method according to claim 86, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.

[0152] 88. A method according to claim 86, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.

[0153] 89. A method according to claim 86, comprising

[0154] associating victim with first and second addresses, and wherein the

[0155] filtering step includes

[0156] discarding traffic received external to an area defined by the points directed to the first address, and

[0157] passing traffic to the victim traffic received external to an area directed to the second address.

[0158] 91. A method according to claim 84, wherein the diverting step includes redirecting traffic using Policy Based Routing.

[0159] 92. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of

[0160] A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim,

[0161] B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim,

[0162] C. the filtering step including identifying any of a source and a type of the overload condition.

[0163] 93. A method according to claim 92, wherein the identifying step includes statistically measuring any of the traffic pattern and volume.

[0164] 94. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of

[0165] A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim,

[0166] B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim,

[0167] C. the filtering step including detecting any of (i) a traffic pattern that differs from an expected pattern and (ii) traffic volume that differ from expected volume.

[0168] 95. A method according to claim 94, comprising determining any of a traffic pattern and volume during a period when the victim is not at an overload condition.

[0169] 96. A method according to claim 95, wherein the determining step includes at least one of

[0170] analyzing any of netflow data, server logs, victim traffic, and victim volume, and

[0171] classifying any of traffic pattern and volume according to types of users that generated it.

[0172] 97. A method according to claim 96, wherein the types of users include individuals users, users sharing a host or proxy, web crawlers and monitoring services.

[0173] 98. A method according to claim 95, wherein the detecting step includes comparing any of a traffic pattern and volume when the victim is at an overload condition with a respective one of a traffic pattern and volume during a period when the victim is not at an overload condition.

[0174] 99. A method according to claim 98, wherein the comparing step includes determining whether any of the traffic pattern and volume varies statistically with respect to an expected traffic pattern and volume, respectively.

[0175] 100. A method according to claim 96, wherein the comparing step includes comparing any of traffic volume, port number distribution, periodicity of requests, packet properties, IP geography, and distribution of packet arrival/size.

[0176] 101. A method according to claim 94, wherein the detecting step includes determining whether any of the traffic pattern and volume varies statistically significantly.

[0177] 102. A method according to claim 94, wherein the detecting step includes determining whether any of the traffic pattern and volume varies statistically significantly from any of an expected pattern and volume, respectively.

[0178] 103. A method according to claim 102, comprising determining any of a traffic pattern and volume during a period when the victim is not at an overload condition.

[0179] 104. A method according to claim 103, wherein the determining step includes analyzing any of netflow data, server logs, victim traffic, and victim volume.

[0180] 105. A method according to claim 104, wherein any of the determining steps include classifying any of traffic pattern and volume according to types of users that generated it.

[0181] 106. A method according to any of claims 94-100, wherein the second filtering step includes detecting suspected malicious traffic.

[0182] 107. A method according to claim 106, wherein the detecting step includes detecting packets with spoofed source addresses.

[0183] 108. A method according to claim 107, wherein the second filtering step includes detecting traffic requiring a selected service from the victim.

[0184] 109. A method according to claim 108, wherein the second filtering step includes discarding traffic not requiring the selected service from the victim.

[0185] 110. A method according to claim 109, wherein the second filtering step includes discarding any of UDP and ICMP packet traffic.

[0186] 111. A method according to any of claims 94-100, wherein the second filtering step including detecting packets with spoofed source addresses by at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0187] 112. A method according to claim 111, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0188] 113. A method according to claim 112, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0189] 114. A method according to claim 1 12, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0190] 115. A method according to any of claims 94-100, the second filtering step including at least partially processing diverted traffic before selectively passing it, if at all, to the victim.

[0191] 116. A method according to claim 1 15, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.

[0192] 117. A method according to claim 116, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.

[0193] 118. A method according to claim 116, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.

[0194] 119. A method according to any of claims 94-100, the second filtering step including discarding traffic of selected type.

[0195] 120. A method according to claim 119, wherein the second filtering step includes discarding any of UDP and ICMP packet traffic.

[0196] 121. A method according to any of claims 94-100, wherein the first set and second set include zero, one or more network elements in common.

[0197] 122. A method according to any of claims 94-100, comprising generating with one or more elements of the second set one or more rules for filtering traffic.

[0198] 123. A method according to claim 106, wherein the generating step includes generating rules that include one or more of a duration of filtering and a network flow to be filtered, wherein a rule for a network flow to be filtered includes any of a source IP address, destination IP address, destination port number, and protocol type.

[0199] 124. A method according to any of claim 122, filtering with the first set of elements traffic destined for the victim, the filtering being performed in accord with the rules generated the one or more elements of the second set.

[0200] 125. A method according to any of claims 94-100, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.

[0201] 126. A method according to claim 125, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.

[0202] 127. A method according to claim 125, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.

[0203] 128. A method according to claim 127, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.

[0204] 129. A method according to claim 127, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.

[0205] 130. A method according to claim 127, comprising

[0206] associating victim with first and second addresses, and wherein the

[0207] filtering step includes

[0208] discarding traffic received external to an area defined by the points directed to the first address, and

[0209] passing traffic to the victim traffic received external to an area directed to the second address.

[0210] 131. A method according to claim 125, wherein the diverting step includes redirecting traffic using Policy Based Routing.

[0211] 132. A network element for use in protecting against an overload condition on a network, the network element comprising:

[0212] an input for receiving traffic from the network,

[0213] an filter coupled to the input, the filter selectively blocking traffic originating from a source suspected as potentially causing the overload condition,

[0214] a statistics module that is coupled to the filter and that identifies traffic statistically indicative of having originated from source potentially causing the overload condition, and

[0215] an output coupled to the input for selectively passing on to further elements in the network traffic not blocked by the filter.

[0216] 133. A network element according to claim 132, comprising a termination detection module that at least participates in determining when the overload condition has ended.

[0217] 134. A network element according to claim 132, comprising an antispoofing element that any of authenticates and verifies a source of traffic.

[0218] 135. A system for use in protecting against an overload condition on a network, the network element comprising:

[0219] one or more network elements (“guards”) disposed on the network, each network element having

[0220] an input for receiving traffic from the network,

[0221] an filter coupled to the input, the filter selectively blocking traffic originating from a source suspected as potentially causing the overload condition,

[0222] a statistics module that is coupled to the filter and that identifies traffic statistically indicative of having originated from a source suspected as potentially causing the overload condition, and

[0223] an output coupled to the input for selectively passing on to further elements in the network traffic not blocked by the filter,

[0224] one or more further network elements (“diverters”) disposed on the network and in communication with the guards, the further network elements selectively (i) diverting to one or more guards traffic otherwise destined for a still further network element (“victim”) in a set of one or more potential victims on the network.

[0225] 136. A system according to claim 135, wherein one or more guards comprises a termination detection module that at least participates in determining when the overload condition has ended.

[0226] 137. A system according to claim 135, wherein one or more guards comprises an ingress filter, coupled to the statistical module, that generates and transmits to a further network element on the network rules for blocking traffic on the network.

[0227] 138. A network element according to claim 135, comprising an antispoofing element that any of authenticates and verifies a source of traffic.

[0228] 139. A network element or system according to any of claims 132-138, wherein a statistical module determines whether any of a traffic and volume of received traffic directed toward the victim varies statistically significantly.

[0229] 140. A network element or system according to claim 139, wherein the statistical module determines whether any of the traffic pattern and volume varies statistically significantly from any of an expected pattern and volume, respectively.

[0230] 141. A network element or system according to claim 140, wherein the statistical module determines whether any of a traffic pattern and volume during a period when the victim is not at an overload condition.

[0231] 142. A network element or system according to claim 141, wherein the statistical module at least one of

[0232] (i) analyzes any of netflow data, server logs, victim traffic, and victim volume, and

[0233] (ii) classifies any of traffic pattern and volume according to types of users that generated it.

[0234] These and other aspects of the invention are evident in the drawings and in the description that follows.

BRIEF DESCRIPTION OF THE DRAWINGS

[0235] A more complete understanding of the invention may be attained by reference to the drawings, in which:

[0236]FIG. 1 depicts a distributed network configured and operating according to the invention;

[0237]FIGS. 2 and 3 depict the architecture of guard machines according to the invention; and

[0238]FIGS. 4a-4 b depict sequence of messages during a three-way handshake for verification of a client.

DETAILED DESCRIPTION OF THE ILLUSTRATED EMBODIMENT

[0239] Network Architecture

[0240]FIG. 1 depicts a protected area P within a distributed network in accord with the invention. Illustrated are a first set of network elements R0-R8, a second set of network elements G0-G3, and a plurality of potential victims H0-H4, all interconnected by network connections. The solid lines represent communication links within the protected area P as well as between elements in that area and a non-protected area outside the oval.

[0241] The first set of network elements R0-R8 of the illustrated embodiment comprise routers of the type commercially available the marketplace and commonly used on an IP network, such as the Internet. Other network elements (by way of non-limiting example, switches, bridges, servers, “guard machines” as described below, or other digital data apparatus) capable of redirecting traffic and otherwise providing the functions attributed below to the routers may be used instead or in addition. Though nine elements of the first set are shown, those skilled in the art will appreciate that greater or fewer such devices can be utilized in a network configured according to the invention.

[0242] The second set of network elements G0-G3 of the illustrated embodiment comprise “guard” machines of the type illustrated in FIG. 2. Other network elements (by way of nonlimiting example, routers, switches, bridges, servers or other digital data apparatus) capable of filtering traffic and otherwise providing the functions attributed below to the guard machines may be used instead or in addition. Though five network elements of the second set are shown, those skilled in the art will appreciate that greater or fewer such devices can be utilized in a network configured according to the invention.

[0243] As shown in the illustration, there need not be a one-to-one correspondence between elements of the first and second sets. Moreover, elements of the second set may be disposed adjacent to elements of the first set, e.g., in close proximity in physical and/or network distance or even as part of a common piece of equipment. An example is provided by elements G3 and R5. Likewise, elements of these various sets may be disposed external to one another, e.g., separated by physical or network distance. Such is the case, for example, with elements R4 and G2 or G3.

[0244] The potential victims H0-H4 of the illustrated embodiment comprise web sites, hosts and servers of the type commonly used on an IP network, such as the Internet. In addition to sites, hosts, and servers, the illustrated embodiment can be used to protect any device with an IP address or interface card to the Internet, such as, any computer connected to the Internet routers and other devices.

[0245] The protected area forms a region on the Internet. The invention can be used with any variety of distributed (or data communication) sub-networks including dedicated networks, local area networks (LANs), wide area networks (WANs), data-centers, metropolitan area networks (MANs), to name a few, whether or not IP based.

[0246] Diversion

[0247] Illustrated R0-R8 or other network elements providing such functionality (collectively referred to below as “routers” or “peering routers”) are placed at points around a protected area of the network. This may be, by way of non-limiting example, a so-called autonomous system (or even a portion thereof), it may also be any other area (e.g., subnetwork) in or on a network, e.g., access points on the Internet surrounding an internet service provider (ISP) and/or its clients. In a case where the protected area is an autonomous system, these points can include the so-called peering points, i.e., points defining all ingress (and egress) routes to that area. In any event, the protected area includes protected elements H0-H4, collectively referred to below as “hosts,” “victims” and/or “potential victims.”

[0248] Under normal circumstances, routers R0-R8 pass traffic to and from potential victims H0-H4 (as well as to and from other network elements) in the conventional manner. When a potential victim, e.g., host H0, comes under an anomalous traffic condition, however (e.g., as caused by a DDoS attack or flash crowd) the routers R0-R8 selectively divert traffic destined for that victim H0 to one or more guards G0-G3, as described below. Following filtering and/or at least partial processing of the diverted traffic, some or all of it (e.g., non-malicious packets, in the case of overload conditions resulting from DDoS attacks) may be directed from the guards to the victim H0.

[0249] In addition to diversion, the routers R0-R8 can provide ingress filtering, e.g., when the host H0 is under overload, utilizing rules defined by the guards G0-G3, also as described below.

[0250] In view of foregoing and the discussion that follows, it will be appreciated that the routers R0-R8 selectively divert traffic, e.g., when a host is under an overload condition, causing that traffic to take a path that it would not normally take, e.g., when the host is not under such condition. That diverted path may be to an adjacent guard machine (or to guard machine processing circuitry and/or circuit pathways, in the case of a router and guard that are co-locate) or to a remotely disposed such machine.

[0251] Activating Protection

[0252] Upon suspecting that an overload traffic condition such as a DDoS attack is being mounted on it or that an overload condition is otherwise occurring (collectively, attacks and overload conditions are sometimes referred to below as an “attack”), a victim or another device alerts the guards G0-G3 through a communication channel supplied by the backbone provider. For example by sending authenticated messages to the NOC (Network Operations Center) from where the signal is relayed to the diverting routers and/or the guards over a secure channel such as SSH (SNMP or out of band communication, or simply IVR systems may be used instead). The alert message contains the identity of the victim machines, (which includes their IP addresses). At this point the victim enters the “protected” mode.

[0253] In this “protected” mode all or most of the traffic flows to the victim have to be diverted such that: (1) all the traffic whose destination is the victim, from either outside the protected area that hosts the victim or from inside the protected area, is redirected to the guards; and (2) all or most of the traffic that reaches the victim must have passed through one of the guards, i.e., no or nearly none of the traffic can reach the victim without passing through the guards.

[0254] The “Double Address” Diversion Method

[0255] In the illustrated embodiment, two IP addresses are associated with each potential victim destination machine (server) the server public address and the server private address. The server public address is the IP address of the server which is published all over the Internet through the DNS system. The server private address is an IP address used solely to transfer packets between the guards and the victim, while the guards protect the victim. Therefore, the server private address is recognized only by either router interfaces that are connected to internal links of the hosting protected area backbone, or to the guards, or to the server interface (The set of links with associated interfaces over which the private IP address is recognized is depicted by dashed lines in FIG. 1). All other interfaces, such as, peering-connections that come from outside the protected area, or links that are connected to other customers of the protected area (stub networks), discard any packet whose destination is the server private IP address (for example, this is easily and efficiently achieved by using the CEF mechanism of Cisco routers). (See FIG. 1). This ensures that no hacked daemon can generate traffic to the victim private IP address.

[0256] To achieve the above setting all the interfaces that are connected to peering links, i.e., links that connect to either other networks or to external hosts and customer networks, are permanently programmed to discard traffic destined to the server private IP address. In normal operation when no attack is being mounted, the victim declares itself to be at distance zero from both the server private IP address and the server public IP address. This causes the routing protocol to set entries in the forwarding tables in all the protected area routers, to forward messages destined to either address to the victim (which is now not a victim) machines.

[0257] To divert traffic destined to the public IP address, server traffic that arrives from outside the hosting protected area during an attack must pass through one of the border routers, i.e., a peering or NAP, BGP routers. A guard machine is placed in each entry next to the boarder routers at this point. Upon receiving the alert of a possible attack on a victim all these border routers are set to forward all the traffic arriving from outside of the network (protected area) and whose destination IP address is the victim public IP address, to the guard machine which is placed next to them. This can be achieved for example by injecting the appropriate update to the boarder routers, updating their policy routing mechanism. Updating the policy routing mechanism, gives us the ability to change the routing behavior without degrading the border routing performance. All the traffic returning from the victim to trusted clients is passed through the corresponding guard machine. Other methods of diverting the traffic destined to the victim are provided, such as, using the appropriated BGP announcement (with a no advertise setting).

[0258] To divert traffic destined to the victim public IP address that originates from within the hosting protected area to the internal or boarder guards, a similar mechanism can be used. That is, to inject when the alert is received, the desired routing information into all the routers. However, this requires updating the policy routing of all the routers in the protected area. In many cases (large networks), it is more beneficial to use a different method, based on a simple routing manipulation. In this method, when the victim suspects that an attack is being applied, it declares itself to be at a large distance from the server (victim) public IP address. At the same time the guards would start to declare that they are at distance zero (or close to zero) from the server (victim) public IP address. This routing updates quickly spread in the protected area network, using the standard routing protocol, e.g., OSPF, EIGRP or RIP (unlike BGP, these routing protocols adapt very quickly to topological changes). Thus, within seconds from these declarations all the traffic whose destination is the victim public IP address, is automatically diverted to the guards. Again, other alternatives to achieve this diversion are possible, such as, using GRE (Generic Routing Encapsulation) tunnels from the internal routers to the guard machines.

[0259] It will be appreciated that the same method can be used to divert the traffic to the guards at the peering points. That is, one may choose between the two diversion methods.

[0260] In some case in order to handle the volume of the intra network traffic, it may be beneficial to use not one guard machine, but a farm of guard machines. However, the problem of attacks, and specially spoofing attacks, in most of the cases is harder when the attack is originated from outside the protected area. When the attack is originated from inside the network, there is full information and management of the network. Hence ingress and egress filtering can be used, to deal with spoofing attack. In cases when the origins of the attack are known, one can more easily stop the attack, by disabling/blocking the origins of the attack.

[0261] When the guards decide that the attack has terminated, they pass an appropriate message to the victim machine. At the same time they reverse the above settings, that is, they stop declaring that their distance from the server (victim) public IP address is zero, while the victim starts declaring again that it is at distance zero from its public IP address.

[0262] Notice that in the “protect” mode several guards may all claim to be at distance zero from the victim public IP address. This divides the protected area into clusters, such that packets with this destination address in each cluster are routed to the guard residing within that cluster. However, there might be routers on the boarder between two or more such clusters with equal distance to two or more guards. This may introduce routing instability, where some packets of a flow go to one guard and some packets go to the other guard. First notice that this effects only victim traffic that originates inside the protected area. The victim traffic that arrives from outside the protected area is treated by the guard at the entry point which acts as a proxy for that traffic. Thus outside traffic would suffer from route flapping only if these flapping are introduced by BGP, which is very rare. To avoid the flapping of victim traffic originating inside the protected area, each guard declares that it is at a very small but different distance from the victim public IP address. These small perturbations ensure that no router would be at equal distance from two guards. The exact calculation of this perturbation is automatically calculated given the map of the ISP's backbone that is covered by the protected area.

[0263] In the network of FIG. 1, the victim private address is known only to trustable parts in the networks, i.e., the interfaces of routers that connected to another router or to the guard machines. The routes in the network where the victim private address is known is marked by dashed lines.

[0264] In some situations it may be also be a burden to manage and configure each potential victim with two IP addresses (the public one and the private one). Here, it can be desirable to use an existing NAT before the server (if such exists) to translate the private IP address to the public address.

[0265] A possible choice for the private IP address, is to use an address from the private IP addresses space as defined in RFC 1918. Moreover, to avoid misuse of these address, most of the networks, use ingress and egress filters, to stop packets destined to a private IP address at the border of the network autonomous system.

[0266] Alternative Redirection Mechanisms

[0267] An alternative redirection scheme that avoids the duplication of the potential victims (targets) IP addresses can use the routers capabilities to route based on the incoming interface card (what is knows as Policy Based Routing (PBR) in Cisco which is also supported in a similar way by Juniper). That is, the router can decide on which interface card to send packet with destination X out, depending on which interface card the packet has arrived. In this alternative method, during an attack (or other overload condition), the peering routers are instructed (via appropriate changes to the forwarding tables) to forward victim's traffic that arrives from either a peering connection or an access connection, to the guard machine (i.e., to the interface that connects to the guard machine). On the other hand, traffic to the victim that arrives from the guard interface card would be forwarded as usual towards the victim. Thus, this scheme requires per interface forwarding and a connection to a guard machine at each peering or access router. All backbone connected interfaces (i.e., internal connections from the ISP point of view) can forward the traffic towards the victim, as in normal operation.

[0268] In an alternative redirection mechanism, the PBR method is used only on the interface card connected to the guard. To get the victim's traffic to the guard an appropriate BGP announcement is given to the router by the guard. In this alternative the route table is updated via a BGP announcement (with a no advertise indication) to direct victim's traffic to the guard, and the interface card connected to the guard is programmed with PBR to forward the victim traffic to the appropriated next hop. The appropriated next hop is determined based on the routing information available at the router both prior to the redirection and following the redirection.

[0269] In a further alternate embodiment, diversion is activated and achieved, in response to anomalous traffic, DDoS attacks or other overload conditions, by using the WCCP (WEB Cache Coordination Protocol) version 2. This protocol, originally designed to support transparent WEB caching is designed to do data diversion of specific flows that arrive on particular interfaces (interfaces coming from the clients). Within WCCP two diversion methods are provided, Layer 2 destination address rewrite for WEB caches directly connected to the router and GRE (Generic Routing Encapsulation) for remote caches. Packets that return from the cache to the router are then routed according to the router's routing table. WCCP allows the nodes of the second set to activate diversion by talking with the nodes of the first set using the WCCP protocol. WCCP can be used for diverting victim's traffic to the guard (as if it was a web caching machine). The traffic that the guard would return to the router (node of the first set) is routed by the router as it would normally be routed (without any diversion).

[0270] In an alternate embodiment, diversion is activated and achieved, in response to anomalous traffic, DDoS attacks or other overload conditions, by using BGP announcements to get the traffic whose destination is victim to the nodes of the second set and using Policy Based Routing (PBR) for the traffic that the second set returns to the corresponding first set node. In this case.

[0271] In related aspects, the invention provides methods as described above in which elements of the first set are selectively activated to provide diversion, e.g., in response to DDoS attacks or other overload conditions. Diversion can be effected, at certain configurations, mostly in the entrances to Data Centers or hosting centers by again using BGP to get the victim's traffic from the first set to the corresponding node of the second set, and then the corresponding node of the second set writes the MAC address or any other layer 2 address of the desired next hop on the diverted packets it sends out.

[0272] In still further embodiments of the invention, diversion can be effected by a combination of foregoing diversion mechanisms, for example, a combination of the BGP method (to get the traffic over to the guard) and some of the other methods, such as, PBR and/or GRE (Generic Routing Encapsulation) to route the packets coming back from the guard to the router.

[0273] One potential drawback here is how to redirect traffic originated in the protected area to the guard machines inside the protected area. A solution employed in one embodiment of the invention is to put guard machines also in every access router. Even where this (or another) solution is not employed, in the worst cases, the alternative redirection mechanism described here affords protection at least from attacks (or other overload-effecting sources) arising outside the protected area. However, this is indeed where the most of the jeopardy comes from—from outside the protected area and not from inside the protected area. This is due to the fact that inside the protected area, the network owner is in control: He can use ingress and egress filtering, backtracking to find the attacker (or other overload sources).

[0274] Recap and Overview of Network Operation and Features

[0275] Networks configured and operated in accord with the illustrate embodiment provide for continuous operation of victim servers during a DDoS attack or other anomalous or overload condition. Internet Service Providers (ISPs) and other suppliers (e.g., data centers and hosting providers) operating guard machines G0-G3 and routers R0-R8, or like functionality, can provide protection to all computers, routers, servers and other elements residing in the protected area of the network, thus, relieving those elements from the need to provide their own protection from DDoS attacks or other overload conditions.

[0276] The guard machines and routers of the illustrated embodiment provide distributed computational power that is invoked when an attack is being mounted. This distributed computational force helps the victim(s) at attack time, by sieving the malicious or overload traffic. Moreover, by stopping that traffic at the border, other network elements within the protected area are protected from side effects that could have been caused by the excess traffic of the attack at the routers.

[0277] The illustrated embodiment features economy of scale. A set of guards machines placed around a portion of the network, such as a protected area P, provides protection from DDoS and other overload conditions for any site or network element inside that area that wishes to be protected. Placing the solution at the ISP level, for example, provides any site small or big a protection from an attack at the full volume that may be supported by the network and the protection system. In this regard, it will be appreciated that attack volume (bits per second) is not a function of the target size, small sites may be attacked at the worst case attacks. Thus any node, big or small, needs the maximum protection of the type provided by the illustrated system. The alternative would be for each site or server to acquire the maximum protection on its own, which is far from being economical.

[0278] The protection offered by the illustrated embodiment is fault tolerant. The guards are placed in such a way that no failure in a guard can disrupt the normal operation of the network. That is, the guards may at worst do nothing but, in any event, they do not degrade the network performances more than it would otherwise be in either normal operation or during an attack.

[0279] The protection offered by the illustrated configuration is also flexible. It can be provisioned to servers and elements requiring protection. That is, the list of sites and elements being protected can be any subset of these that reside inside the protected area.

[0280] By way of review and overview, operations in the illustrated embodiment include the following steps: detection, alert, divert, sieve, and termination detection. Those skilled in the art will, of course, appreciate that other embodiments may use greater or fewer steps and, moreover, that those steps may vary from the specifics described below.

[0281] Detection.

[0282] The illustrated embodiment assumes that an attacked victim has an automatic mechanism that detects and alerts when an attack begins. Such mechanisms are provided by different routers, firewall equipment, intrusion detection systems, and operating systems. Some data-centers and hosting farms provide servers health check mechanisms that monitor their clients condition, one of which is overload and anomalous traffic condition. For sites without such a detection mechanism, any number of conventional techniques can be employed within the victim, within the guards, or at any other suitable node in the network (collectively, the “alert nodes” or “alert network”).

[0283] Alert.

[0284] Upon suspecting that an attack is being mounted on it, a site (or other alert node) raises the flag and generates an alert that activates a network of guard machines that are located at strategic points around an area of the network in which the victim resides. The alert signal, from the alert node, would usually go through the NOC (Network Operations Center) and from the NOC to the guard machines. For example, in one embodiment, guards are placed around the protected area that hosts the victim, one guard at each peering point.

[0285] Divert.

[0286] In addition, the alert network invokes a rerouting mechanism (e.g., the routers R0-R8, or similar functionality) that ensures that all traffic originating outside the protected area (and at least some, if not all, traffic from within that area) destined to the victim is diverted to, and passes through, the guards. Thus, in the case of a DDoS attack, for example, there is no way for a malicious daemon to send a packet directly to the victim on a route that passes any of the selected nodes.

[0287] Sieve.

[0288] When an alert arrives at a guard and the victim traffic is being received, the guard sieves the traffic to sort out the “bad” (or excess) packets and pass on to the victim only the “good” (or non-excess) traffic. Under certain conditions the guard may process the requests that are being sent to the victim, on the victim behalf, either at the guard machine or by forwarding the requests yet to another node (by way of a non limiting example, a reverse cache proxy) that would process the requests on the victim behalf.

[0289] Termination Detection.

[0290] While the guards actively protect a victim they monitor the amount of “bad” packets they sieve out. If the total amount sieved out by each of the guards subsides below a certain level for a long enough period of time the attack is defined to have terminated and the diversion is stopped, routing of victim traffic returns to normal operation and the sieving of victim traffic is thus also stops. In general the guards continuously send indications on the level of attack to the NOC, and the decision to stop the protection and inactivate the system with respect to a victim may be taken at the NOC.

[0291] The Guard Machines

[0292]FIG. 2 depicts the architecture and operation of an embodiment of a guard machine 10 according to the invention. The device 10 includes a filter 12, anti-spoofing module 14, statistical engine 16, termination detector 18, customer database 20, and management module 22, interconnected as shown in the illustration and evident in the discussion below. These functions can be implemented in software, firmware or hardware within a stand-alone networked digital data processing device, or as part of (or otherwise in connection with) a switch, router, personal computer, workstation, server, or other digital data processing apparatus.

[0293] Filter function 12 receives the diverted data and classifies it according to different rules (filters) given to it. With each filter-rule given to the filter an action may by associated. The filter-rules are placed in the filter either when the guard starts protecting a victim or dynamically by the management of the guard in response to indications received from the statistical engine. Actions associated with filter-rules tell the filter what to do with the flows/packets that match that filter. Some of the filter-rules block packets originating from IP addresses or subnetworks that were suspected as being a source of malicious traffic, e.g., as determined by statistical engine 16. Other actions could tell the filter towards which other module to direct the traffic that corresponds to the respective filter-rule.

[0294] Anti-spoofing function 14 authenticates and verifies for each flow (<source-address, destination-address, source-port, destination-port>quadruple that a real process at the client with that source-address and behind that source port-number has initiated this TCP flow. This is done in the known way of completing the TCP three-way handshake process at the guard on behalf of the victim. From this point on, for the duration of this connection (determined by the quadruple), the guard becomes kind of low-level proxy between the client and the victim server. One aspect of the syn-defender (another name for the TCP anti-spoofing block) is that once the traffic is cleaned from spoofed packets it can be statistically analyzed to detect for example sources of malicious TCP traffic (which would have been much harder without first cleaning out the spoofed packets).

[0295] Statistical engine 16 detects and singles out flows or aggregates of flows (aggregates are identified by any subset of the quadruple and the IP addresses in the subsets may be replaced by subnetworks) with irregular/suspicious behavior. Once a miss behaving flow is detected the necessary modules are activated to sieve out this flow. This process of treating the miss behaving flow could include further more refined study of the sub-flows of this flow, or activating a special set of one or more modules that clean such a flow, or the identity of these flows is passed to filter 12 for blockage.

[0296] Termination detection function 18. All the guards cooperatively decide when an attack has stopped and the victim may return to peaceful operation mode. This termination detection has two steps: First each guard individually monitors the volume of “bad” (or overflow) traffic it blocks for a particular victim. Secondly, when this volume subsides at all the guards for a long enough period of time then a collective decision that the attack has terminated is reached. The collective decision is reached in one of two ways: either by each guard reporting its level to a central point such as the NOC and the NOC decides termination as a function of all the indications it gets from all the guards, or in a more distributed way in which each guard receives these indications from all the other guards and decides according to these indications.

[0297] Customer database 20 (including illustrated storage module and interface module) maintains statistical information about each potential victim traffic patterns and about default settings for the filter/classifier, WFQ (discussed below) and throttling level (discussed below). The default settings for the filter/classifier indicate what types of packets/traffic the filter may deny access to the victim while the victim is under stress. Typically these would be flows and packets that are not that important for the victim and it could continue providing its basic and important intended service without getting these type of traffic.

[0298] Management module 22 fulfills two basic functions. First it coordinates interaction between the other elements of the guard machine, e.g., getting indications from the statistical engine and passing resulting decisions to the filter, or facilitating flow of packets there through. Second, it interacts with the management application that could reside elsewhere (e.g., at the NOC), receiving from it instructions and passing the resulting commands to the appropriate modules in the guard, e.g., to start or stop protecting a particular victim, to start or stop blocking particular types of traffic for a particular victim, etc.

[0299] With respect to overall flow in the device 10, thick lines in the drawing represent the flows of victim traffic through the machine while the thinner lines represent control and other information paths. Preferably, packets first pass through the filter, then through the anti-spoofing and finally through the statistical module, as indicated in the drawing.

[0300]FIG. 3 depicts the architecture and operation of alternate embodiment of a guard machine 10′ according to the invention. The machine 10′ includes a management element 22′ and defense coordination element 23 which, together, correspond to element 22 of FIG. 2; termination detection element 18′ which corresponds to element 18 of FIG. 2; statistical collection element 16′ and intelligent learning control element 17 which, together, correspond to element 16 of FIG. 2; classifier/filter element 12′ which corresponds to element 12 of FIG. 2; Syn-defender/anti-spoofing element 14′ and TCP element which, together, correspond to element 14 of FIG. 2; customer profiles database element 20′ which corresponds to element 20 of FIG. 2; termination detection element 18′ which corresponds to termination detection function 18 of FIG. 2; NIC element 2; re-assembly element 4; out of band element 6; regular TCP/IP stack element 8; /dev/null element 11; DNS element 16; defense coordination element 23; TCP traffic de-multiplex element 24; WFQ element 28; send out element 32; HTTP proxy element 36; MIB agent element 26. The elements are interconnected as shown, though, for clarity, not all the interconnections are presented.

[0301] With reference to FIGS. 2 and 3, each guard machine 10, 10′ receives a portion or all of the traffic destined to a victim or a set of victims and sieves out the malicious (or excessive) traffic, forwarding to the corresponding victim legitimate traffic at a rate it (the victim) can sustain. In doing so, the guard is like a large filter identifies “bad” packets (or packets that would otherwise cause an overload condition) and discards them. The guard machine 10, 10′ architecture described here includes elements that, individually and/or together, block and detect most malicious (or excessive) traffic flows. In the case of DDoS attack, even if the “black hats” (hackers) generate a large amount of traffic that looks legitimate, the guard machines (e.g., working in connection with the routers R0-R8) protect the victim from overload in the form of an API to a large distributed reverse proxy (element 36). The size of the reverse proxy connected with the guard system corresponds to the power the illustrated system.

[0302] Among other things, the guard machines 10, 10′ perform the following functions:

[0303] 1) Clean noise generated by malicious (or overload event-causing) sources at the lower layers of communication before cleaning the higher layers of traffic. By way of analogy this is similar to cleaning a noisy signal in signal processing, where low phase filters block higher frequencies first, before lower frequency signals may be analyzed and cleaned. In the case of the DDoS, the guards 10, 10′ preferably filter spoofed packets first. The traffic passed to the statistical analysis and WFQ modules is assumed to be non-spoofed; otherwise the effectiveness of these modules may be reduced. Moreover, once the traffic is non-spoofed at the packet layer, new modules are introduced that clean the traffic from higher level spoofing, e.g., from masquerading legitimate users that generate large volumes of traffic.

[0304] 2) Invocation on demand of different modules as dictated by the statistical attack identification module. The statistical engine function 16 (FIG. 2) or 16′ and 17 (FIG. 3) detects the presence of different generic attack methods in the steam of victim traffic. As soon as an attack type is detected, the corresponding defending element (e.g., guard(s) and/or router(s)) are invoked and activated on the corresponding traffic. For example, if the attack identification identifies an exceptional volume of DNS requests, the engine 16 or 16′/17 concludes that a DNS request attack is being mounted and the DNS defense module 36 is activated. The classifier 12′ redirects the victim DNS traffic to pass through the DNS defense module 36′.

[0305] 3) Zooming principle in the statistical attack identification module. The statistical engine 16 and 16′/17 first monitors the traffic at a certain level of coarseness. Once an exceptional volume is detected at certain type of traffic (e.g., UDP), a more refined statistical detection is invoked to find out more specific parameters of the offending traffic flow. Continuing the UDP example, the more refined detection would find what port number and/or what source IP address is generating the attack, if the attack is not spoofed over many addresses and/or port numbers.

[0306] Victim traffic that has neither been identified as malicious nor has been processed on behalf of the victim (e.g., by the guard or other node) is passed on to the victim. Still, to ensure that no denial-of-service attack goes unnoticed, the guard 10′ throttles the amount of traffic passed on to the victim. That is, only a certain amount of traffic is allowed to be passed on from each guard to the victim. Thus, regardless of whether an DDoS attack is being mounted, an activated guard prevents an traffic overload condition at the victim node.

[0307] The amount allowed from each guard is initially set by a victim default profile (stored in the customer profiles database element 20, 20′), though this may be dynamically modified in coordination with the amounts other guards are passing to the victim. Whenever the amount of traffic that is being passed to the victim is larger than the rate allowed, the excess is queued up in a Weighted Fair Queuing (WFQ) module 28. This module controls access rate to the victim, using fair access rate to all the clients. The idea is to use a weight to each queue that could for example correspond to clients or source IP addresses, or any other traffic classification parameters, such as port numbers, and/or protocol types.

[0308] Each queue weight is proportional to the estimate of traffic from each such source (client). A malicious client that attacks (or a legitimate client that is making too many requests) and, hence, is applying a larger than expected volume on the victim, is throttled by the WFQ, and thus limiting the effect it applies on the access rate of other legitimate clients. Default settings for the WFQ indicate which sources (IP addresses) should get a larger relative share of the victim bandwidth, and default settings of the throttling levels are a function of the victim available bandwidth and the relative amount of it that should pass through this guard.

[0309] Traffic flow through guard 10′ can be like that of guard 10. Alternatively, in guard 10′, packets can first pass through the filter/classifier 12′, then through one of the modules, DNS 36, UDP 13, TCP 15/anti-spoofing 14′, then through a weighted-fair-queuing module 28. In addition, the statistical module 16′/17 monitors the activities in each of the modules to detect misbehaving traffic flows and/or suspicious traffic patterns that could indicate an attack type or point out a malicious source.

[0310] Referring to FIGS. 2 and 3, it will be appreciated that the statistical engine 16 (FIG. 2) and the statistical collection 16′ together with the intelligent learning control 17 (FIG. 3) monitor the victim's TCP traffic (among other traffic types) after it has passed the anti-spoofing module 14′. This gives the statistical engine 16 or elements 16′ and 17 the ability to effectively detect sources that generate exceptional volumes of traffic without confusion from spoofed traffic. Similar logic also works for UDP and other types of IP traffic. Moreover, the different lines of defense (each being a module inside the guard box) are activated by the statistical engine 16 or 16′/17 only if an exceptional behavior is noticed in a particular type of traffic (TCP, UDP, DNS, ICMP, etc).

[0311] NIC element 2 is the network interface card through which the guard machine is connected to routers or other members of the first set of nodes. The NIC could be a 1 Gbit/sec or an OC3 or and OC12 or any other NIC.

[0312] Out of band element 6 is an interface to a separate channel of communication through which network managers/operators and other authorized elements privately and securely communicate with the guard machine. This separate channel of communication is a dedicated communication medium not open to the public. The corresponding interface can be a serial interface or any NIC or other medium interface used by the managers and/or operators of the protected network.

[0313] Regular TCP/IP stack element 8 receives the out-of-band communication, which arrives from the network operators and passes it to the appropriate elements in the guard machine, such as, to the control and management element 22′ and/or customer profiles database element 20′.

[0314] Re-assembly element 4 receives the diverted traffic and checks for fragments in the TCP part of the traffic. It collects the fragments and re-assembles complete packets, which are fed through the other elements of the guard machine. In doing so this elements communicate with the statistical collection and intelligent learning control elements to detect attacks that are based on sending large volumes of fragments. In such a case the Syn-defender/anti-spoofing element 14′ provides feedback regarding the nature of spoofed fragments (for which no connection was opened by the syn-defender element 14′). In addition a small per source queuing system within element 4 helps in mitigating fragments attacks.

[0315] Classifier/filter element 12′ behaves much like the filter function 12 in FIG. 2. It receives the diverted data and classifies it according to stored rules (filters). With each filter-rule, there may be an associated action. The filter-rules are placed in the classifier/filter either when the guard starts protecting a victim or dynamically by the management of the guard in response to indications received from the statistical collection and the intelligent learning control elements 16′ and 17. Actions associated with filter-rules tell the filter what to do with the flows/packets that match that filter. Some of the filter-rules block packets originating from IP addresses or subnetworks that were suspected as being a source of malicious traffic, e.g., as determined by the intelligent learning control element 17. Other actions can direct the classifier/filter towards which other elements to direct the traffic that corresponds to the respective filter-rule. Thus, by way of a non-limiting example, if the intelligent learning control element decides based on the statistics data it receives that a DNS attack is being mounted, it registers a new filter-rule saying that each packet belonging to the DNS protocol is now forwarded to the DNS element 16.

[0316] Statistical collection element 16′ collects samples and builds statistics about types of flows that pass through the different elements of the guard machine. The function of element 14 in FIG. 2 is broken down into two elements in FIG. 3, the statistical collection element and the intelligent learning control element. The statistical collection element can collect statistics about a new type of flow as decided by the intelligent learning control element. This happens in the case that a more refined analysis is necessary of a high volume flow in order to figure out which source, or other sub type generates the exceptional volume in that type of flow. The statistical collection element first monitors the traffic at a degree of coarseness. Once an exceptional volume is detected by the intelligent learning control element for a given type of traffic (e.g., UDP), a more refined statistical detection is invoked to find out more specific parameters of the offending traffic flow. This is achieved through monitoring by the statistical collection element 16′ (at the command of element 17) of a more refined sub-flow traffic volume. Continuing the UDP example, this more refined detection would identify what port number and/or what source IP address are generating the attack (which is a UDP attack), if the attack is not spoofed over many addresses and/or port numbers.

[0317] Intelligent learning control element 17 obtains the statistical information from element 16′ and makes decisions using learning methods (e.g., simple threshold passing, or decision trees, or other learning decision methods). The elements becomes more powerful with type of interaction it has with the statistical collection element 16′ and the defense coordination element 23. Through interactions with the statistical collection element 16′, learning control 17 can provide more refined statistics that would allow the zooming functionality describe above.

[0318] When a specific type of malicious traffic is detected, that is, a specific type of attack, the defense coordination element 23 is alerted. In response, defense coordination element 23 registers the necessary filter-rules in the classifier/filter element 12′ and invokes the necessary elements to sieve out the type of attack detected.

[0319] Control and management element 22′ provides among others the following functions: it receives the information coming from the management application (that resides e.g. in the NOC) over the private out-of-band channel and/or the secure channel that arrives over the normal communication channel and places the received information in the appropriate element. These data could be for example: (i) customer profiles to be places in customer profiles database element 20′, (ii) configurations and instructions to the defense coordination element 23, telling it to perform certain types of sieving, or (iii) initial or a new set of filter-rules that should be used by the classifier/filter to block and or direct certain types of traffic to appropriated elements.

[0320] DNS element 16 receives the DNS packets following the detection of a DNS attack. This element sieves out DNS requests and replies to statistically identify the malicious sources.

[0321] UDP element 13 receives the UDP packets following the detection of a UDP attack. This element sieves out UDP packets, only when a UDP attack is identified, by checking that each UDP packet is between a source and a victim for which a valid connection was established by the syn-defender/anti-spoofing element 14′.

[0322] Syn-defender/anti-spoofing element 14′ works in the same way as function 14 in FIG. 2 does.

[0323] TCP element 15 receives the TCP packets except to those forwarded by the classifier/filter to the syn-defender element 14′. The TCP element checks each such packet to verify that a valid connection with the same source and destination IP addresses is established. Thus in effect making sure that the only TCP packets forwarded to the victim belong to a connection that passed the anti-spoofing verification step (performed by element 14′).

[0324] /dev/null element 11 receives the packets that should be discarded from the classifier/filter element 12′. The only purpose of this element is to facilitate the collection of statistical data on the discarded packets, as required by the statistics collection element that needs it in turn for the termination detection and possibly for the intelligent learning control element.

[0325] De-multiplex element 24 receives the non-spoofed TCP packets and forwards them to different elements as determined by defense coordination element 23. For example, if a flash-crowd situation is detected, then the defense coordination element 23 instructs the de-multiplex element 24 to forward all the HTTP/TCP packets (port 80) to the HTTP cache proxy that was attached to the guard (if one is attached). In another example, all the TCP SYNACK packets that are generated by the syn-defender element 14′ are directly sent to the NIC for transmission without going through the WFQ element 28 (since only traffic forwarded to the victim should go through the WFQ element).

[0326] HTTP proxy 36 represents a customer-supplied (e.g., ISP-supplied) module that provides the reverse web cache proxy functionality in case a flash-crowd situation is identified. In such a case the HTTP request traffic is diverted to the cache proxy 36 that services the requests on behalf of the victim. It is up to the customer to supply the appropriate cache proxy that can support the type and volume of HTTP requests that are expected under these circumstances.

[0327] WFQ element 28 controls access rate to the victim, using fair access rate to all the clients. The idea is to use a weight for each queue that could for example correspond to clients or source IP addresses, or any other traffic classification parameters, such as port numbers, and/or protocol types. Each queue weight is proportional to the estimate of traffic from each such source (client) and/or desired quality of service. A malicious client that attacks (or a legitimate client that is making too many requests), and hence is applying a larger than expected volume on the victim, would be throttled by the WFQ, and thus limiting the effect it applies on the access rate of other legitimate clients. Default settings for the WFQ indicate which sources (IP addresses) should get a larger relative share of the victim bandwidth, and default settings of the throttling levels are a function of the victim available bandwidth and the relative amount of it that should pass through this guard. In addition to a queue for each source IP address that communicates with the victim, the illustrated WFQ element can provide one or more queues of each of the UDP packets and the DNS requests among other types of flows.

[0328] A still more complete understanding of the operation of guards 10, 10′ may be attained by reference to the discussion that follows.

[0329] TCP Anti-Spoofing

[0330] The traffic generated by DDoS attacks may be categorized in different ways, one of which is into two types: spoofed and not spoofed. In the spoofed packets, the source IP address is made up and is not the real source address of the machine from which the packet originates. In later sections mechanisms for dealing with the non-spoofed flows of packets are addressed. Here, we describe how the spoofed (masqueraded) packets are identified and blocked by guard machines of the type illustrated in FIGS. 2 and 3.

[0331] The spoofed packets may be of different types, such as, ping packets, other ICMP types, SYN packets from the first phase of TCP handshake, or other TCP or UDP packets. During an attack, the guard machine 10, 10′ analyzes only the packets that are directly necessary for the service provided by the target of the attack (the victim). Assuming that the service is web service (HTTP based) all other packets such as UDP, ICMP and others are discarded by the guard machines 10, 10′. If the service is different, such as a mail server, or IRCs, then the corresponding packets are passed and the others that are not necessary for the service are discarded.

[0332] Here we describe how the most popular and difficult to protect spoof SYN attacks are blocked using anti-spoofing techniques which are TCP oriented. As with the TCP intercept model originally described by Checkpoint and Cisco, the guard machines 10, 10′ conduct a three-way hand shake with the client, and only after verifying that a real client is operating behind the claimed source IP address and source port number, the connection is established also with the victim. Thereafter the guard machine 10, 10′ operates as a proxy (TCP proxy) between the client and the victim.

[0333] When a client wishes to open a TCP connection with a server, it sends a SYN request, notifying the server about its attempt to open a new connection. The server authenticates the client source address by sending the client a random number (also used as the initial sequence number for the flow of packets). Then, the server waits to receive this number back from the source. Being spoofed the SYNACK is sent to a non existing client which does not respond. In such a case the guard times out the connection and discards it (see FIGS. 4A-4B).

[0334] The SYN mechanism depicted in FIGS. 4A-4B for the connection establishment (three way handshake) is also one of the known denial of service attack methods. In this attack a huge number of spoofed SYN-requests are being sent to the server. Each such request must be buffered and kept by the server for a period of time (30 seconds by the standard) until its corresponding SYN-ACK is received. The SYN-request buffer at the server overfills which at worse brings the server down and at best causing the server to ignore good genuine requests to open new connections.

[0335] Each of the guard machines 10, 10′ is a specially designed to handle a huge number of connection requests at very high speeds. Moreover, the distributed architecture of our system distributes the load among the different guard machines. FIGS. 4A-4B show the sequence of messages during the three way handshake. The first figure, FIG. 4A, shows the normal sequence of messages during the three way handshake between a client whose IP address is 12.12.12.12 and a server whose IP address is 10.10.10.10. In FIG. 4B, the same process is performed but now the SYN request message is intercepted by the guard machine which then performs the three-way handshake on behalf of the server. Only after the guard machine 10, 10′ receives the correct SYN-ACK message from the client it opens the corresponding connection with the server and starts to function as a low level proxy between the client and the server.

[0336] Ingress Filtering

[0337] The guards of the illustrated system which are placed adjacent to routers help in ingress filtering by computing and instructing those routers R0-R9 which source IP addresses are suppose to arrive on each interface and which are not. The actual ingress filtering is performed by the routers (assuming the routers have the capability to filter according to the source IP address of packets on a long list of prefixes). This method is used both in normal operation and during an attack. At attack time the guards may thus employ the filtering mechanisms of the adjacent routers to block spoofed UDP or ICMP packets.

[0338] In the illustrated system, guards sitting around the ISP backbone learn the legitimate source IP addresses that may enter each of the router interfaces and instructs the router which sources to accept and which to deny. Notice that even though BGP routes are asymmetric and unstable, the majority of rules (of which sources to block and which to pass) are static and may be learned by assuming the symmetric characteristic of paths. However, since this is not always the case, and the illustrated system adapts and tracks the changes in the routings. To this end, it uses two techniques to gather the information necessary for the computation of the required knowledge (e.g., using a mechanism of the routers that give information of the incoming traffic such as Netflow):

[0339] 1. Sampling the traffic that arrives on each interface in order to discover changes in the source addresses that are received over this interface.

[0340] 2. Using ping (from the guard machines), to find out if the changes are legitimate, or a fake source IP address. In case of a spoofed address the answer to the ping is received on a different interface or on a different boarder router.

[0341] Attack Identification, Recognition and Isolation Via the Statistical Recognition Unit.

[0342] The statistical unit 16 monitors all the victim traffic that has passed the anti-spoofing authentication and was not stopped by the filter. The unit 16 samples and analyzes the traffic and identifies malicious sources (i.e., compromised sources), and provides operational rules for blocking the attack without disturbing innocent genuine traffic. The basic principle behind the unit's operation is that the pattern of traffic originating from a black-hat daemon residing at a source drastically differs from the pattern generated by such a source during normal operation. In contrast, traffic patterns of “innocent” (un-compromised) sources during an attack resemble their traffic at normal times. This principle is used to identify the attack type and source and provides guidelines for either the blockage by either the filter or other modules in the guard or further analysis of the suspected flows by refined monitoring by the statistical unit. For example, the statistical unit could decide that there is a UDP flood attack following which a more refined monitoring by the statistical unit would reveal that the UDP flood attack is on port 666 from a set of source IP addresses. Parameters that the statistical unit monitors in the stream of packets may include but are not limited to: the volume of a traffic from an attacking daemon, the distribution of packet sizes, port numbers, the distribution of the packets inter arrival times, number of concurrent flows, higher level protocol characteristics and the ratio of inbound and outbound traffic are all parameters that may indicate that a source (client) is an attacking daemon. The statistical unit 16 has two major tasks:

[0343] 1) Learning the traffic patterns during normal operation, i.e., when no attack is being mounted. These patterns are used while defending a victim during an attack to compare with the actual traffic in order to distinguish the malicious traffic from genuine traffic. We consider three possible ways in which this learning can be done: (1) Using the routers NetFlow data, (2) Analyzing the server logs at the victim server, and (3) Analyzing the potential victim traffic at the guard by having the traffic diverted to the guard from time to time for randomly sampling it.

[0344] 2) Monitoring the victim traffic during an attack to identify and isolate the malicious traffic from the good genuine traffic. The identity of the attacking host is then given to the filter or the neighboring routers that would then drop any packet arriving from that host.

[0345] Network Flows and Traffic Classification

[0346] The basic element studied by the statistical unit 16 is a flow. Each flow is a sequence of packets belonging to the same connection. In the most general way a flow is identified by the following parameters: Source IP address, Source port, Destination port, Protocol type, time of day and day of week of connection creation. The destination IP address is implied since all the information is collected per destination address. For each such flow the traffic volume is registered.

[0347] Keeping all of the above information is infeasible since it requires an unacceptable amount of memory. However learning methods are employed to identify the basic characteristics of the traffic destined to each destination and keep these key parameters succinctly, in an efficient way. Essentially the learning method studies the typical behavior of groups of users that interact with the destination. For example, a typical web site is accessed either by individual users sitting behind a host (pc), by a group of users sharing one multi user time sharing host, or by a group of users sitting behind a proxy. For each such group its typical behavior is studied. Other types of users are possible such as web crawlers (for search engines) and monitoring servers such as keynote (www.keynote.com). Furthermore, for the largest group, i.e. the group of individual users, their identities (IP address) is not kept. Each source which is not included in the other groups is assumed to be an individual source. On the other hand, for the group of proxy machines that access the destination, the individual IP address of each is kept in a tree like data-structure. For other groups of users only their IP address may be needed since their traffic would be blocked from the beginning during an attack. Henceforth, the rest of this section considers types of users and the characteristic of flows originating from such users.

[0348] The basic parameters characterizing each user group are:

[0349] 1. Traffic volume distribution: These include the mean, median, peak and variance of the traffic such a user generates.

[0350] 2. Port numbers distribution: Source port number distribution, and destination port number distribution.

[0351] 3. Periodicity: Sources are examined for the periodicity of their requests. It is likely that malicious sources act in a relatively periodic manner, while innocent sources act not in a regular manner.

[0352] 4. Packet Properties: The distribution of packet sizes, port numbers and other properties characterizing different attacks (known and new ones).

[0353] 5. Protocol specific characteristics: for example http error rate and refresh rate.

[0354] Below is a more detailed list of candidates parameter that characterize a client:

[0355] 1. Traffic Volume: Requests and return bandwidth. The traffic Volume, may be characteristic by leaky buckets, or by using exponential average (T_(i)=(1−a)T_(I−1)+a d_(i)).)

[0356] 2. Inter Arrival time.

[0357] 3. Session length and variance

[0358] 4. Quit time

[0359] 5. Request order (http level)

[0360] 6. Percent of erroneous requests.

[0361] 7. Percent of refresh request and percent of if modified since requests.

[0362] 8. Time and date.

[0363] 9. Geographies information.

[0364] 10. Subnets information.

[0365] 11. The history of IP (is this IP in the black list).

[0366] 12. The length of the client's queue in the WFQ.

[0367] 13. Is this clients have a legitimate cookie (in the site level).

[0368] 14. The percents of a CPU consuming requests: (search, asp, cgi, encryption).

[0369] 15. Learning Traffic Characteristics

[0370] The averages in the above parameters can be computes using standard averaging techniques such as exponential average, running average, average in a window of time, etc. There are three possible ways to learn and analyze the traffic characteristics of a particular target:

[0371] 1. Sampling a fraction of the packets (a in (0,1)) traversing the lines on route to the target and then classifying the packets according to the flow id and time of day and day of week. Notice that setting α=1 requires the unit to process every packet and thus imposes high load on it while providing the best statistical measure. Lower values of a reduce the load posed on the unit while potentially somewhat degrading the statistical measure. The fraction, therefore, is a parameter that is set so that enough statistical knowledge can be gained without over-loading the system.

[0372]  Some practical ways for sampling include duplicating traffic to the guard machines and (using special switching mechanism or special capabilities of routers for duplicating the traffic); redirecting the traffic by operating guard machines as if there is attacks on the site, for some small periodic time in the day; and putting a special machine that monitoring the traffic in the site.

[0373] 2. Utilizing server logs collected by the defended target. These typically contain information about the activity being applied on the target. For example, WEB sites, which are likely to form the main body of potential targets, keep logs that record all the document requests sent to the site (including their source address, time of the day and other parameters). Processing of these logs by the illustrated system yields a very accurate measure of the statistics of network flow volumes (measured in packets per second, as in a) above). The potential draw backs of this method are first that being collected at the target it is not immediately clear which information is relevant to which guarding point, and second, the pattern seen by the target may be slightly different from the pattern seen at the network boarder. However neither is a real problem and the first one may be a feature, since network routes change and the traffic may enter the network from a different point during an attack.

[0374] 3. Analyzing netflow data collected from the appropriated routers. This option requires the backbone provider to enable netflow and process it with our learning applications. This method has some limitation but none seems prohibitory. The limitations are that netflow aggregates information for each flow in intervals of a few minutes (typically 5 minutes intervals), and in this intervals it does not maintain the sizes of individual packets. Rather, it counts the total number of packets and bytes passed in this interval for each flow. Another limitation of netflow is that the ISP has to be more involved in acquiring the data. In particular most Cisco routers would send netflow data only to one destination. Thus the data would have to come from the ISP and not directly from the router.

[0375] Traffic Monitoring and Analysis at Attack Time

[0376] In an attack or overload condition, the guard machine defends a victim it monitors the victim traffic, classifies its traffic (incoming and outgoing) and compares the traffic to the normal traffic in order to detect the malicious traffic. Notice that during an attack information is collected only on the current flows. The information about well behaving flows is not kept more than small number of minutes.

[0377] 1. Online traffic volume collection at attack time: This module collects the statistics of the traffic destined to the target(s) in attack time. Notice that in this sense, its measures are similar to the measures collected in approach 1 above. The classification of the traffic, in general, is similar to that conducted in the learning phase but may be controlled/guided by external intervention. Such intervention is enacted if some additional knowledge on the attack type is gained from other sources (e.g., human-aided identification) and can be utilized by the unit.

[0378] 2. Attack Analysis: The traffic characteristics collected in the previous step are compared with the characteristics learned during normal operation to discover the malicious sources. The identified sources of malicious traffic are then blocked by the filter components of each guard. The output of this step is a sequence of rules instructing the filter which flows to block. Each such rule has two parameters:

[0379] a. Network flow, identified by a combination of source IP address (can be prefixed), destination IP address (may be one or more), destination port number, protocol type (one may consider blockage that disregards port numbers, i.e., all the traffic originating from a compromised IP address, be it a proxy or a host).

[0380] b. Duration, identifying the duration for which that class is blocked.

[0381] The analysis is based on the statistical parameters of the data and aims at keeping the target traffic at normal loads by blocking the most “suspicious” and “harmful” traffic streams. Blocking rules are based on maximizing the likelihood of blocking harmful traffic while minimizing the likelihood of blocking innocent traffic.

[0382] Statistical Recognition ofData “Innocence”

[0383] The guard machines uses two major properties of network flows to identify malicious traffic: a) Traffic pattern, and b) Traffic volume. Below we describe the recognition approaches based on these factors.

[0384] Recognition of Traffic Pattern

[0385] Several aspects of traffic pattern are examined:

[0386] 1) Source “IP geography” proximity: Sources are classified into classes that resemble the “IP geography”, that is IP addresses that reside on neighboring networks (using IP address prefix) are classified in the same class. A class that generates a relatively large volume of requests is suspected as being malicious. Notice, that such “malicious classes” are likely to form if the attacker planted a collection of daemons in the same network, and this network does not use a proxy.

[0387] 2) Periodicity: Sources are examined for the distribution of packet inter-arrival times. It is expected that the inter-arrival times distribution of a malicious daemon is different than the inter-arrival times distribution of an innocent source (user or proxy). For example, it is likely that malicious sources act in a relatively periodic manner, while innocent sources act in more irregular pattern.

[0388] 3) Packet Properties: Sources are examined for repetitive properties of their packets. For example the distribution of packet size. It is likely that malicious sources generate packets of identical properties (e.g.—all packets of same size) while innocent sources generate packets of more random nature. Other properties include port number distributions. Blockage of sources is done sequentially until the total volume of unblocked sources is below the traffic volume that can be sustained by the target server. In the distributed, illustrated system this threshold may depend on the load at other guards. A distributed algorithm is used to coordinate these thresholds between the different guard machines.

[0389] 4) Protocol Specific properties: depends on the protocol such as http(error and refresh rate) DNS (error rate) etc.

[0390] Recognition of Traffic Volume

[0391] Traffic volume recognition is used to identify malicious sources that transmit large volumes of data that significantly differ from their normal volume. Specifically, Internet data sources are classified as either small sources or large sources. The former relates to individual IP addresses whose traffic volume is normally tiny. The latter relates to Proxy traffic or Spider (Crawler) traffic whose volume is drastically higher. (The traffic volume resulting from a Spider access is normally higher than that of a single human user, especially on large WEB sites. The reason is that a spider scans the whole site, leading to hundred or thousands of requests while a human client requests tens of pages or less, on average.)

[0392] The illustrated system keeps individual volume parameters for each of the large sources (e.g., proxies such as the AOL proxies and other edu and large companies proxies). Individual parameters are not kept for the small sources (representing individual clients); rather one set of parameters characterizing the mean, median and variance of typical users of the target server. At attack time the traffic volumes of individual flows is measured and compared to their recorded volume. Flows whose volume drastically differs (upwards) from their recorded measure are marked as being malicious.

[0393] The mathematical formulation of this procedure can be done for example as follows: Given are K classes of flows, indexed 1, 2, . . . , K, and characterized by the mean (μ_(l)) and the variance (σ_(i)) of their learned volume, and by their current volume (X_(l)). We would like to identify the classes with the largest deviation from their corresponding expected volume. Let Y_(i)=(X_(i)−μ_(i))/σ_(i) . The illustrated system sorts the classes by the value of Y_(i) and recommend blocking the classes with the largest values of Y_(i). If the variance, σ_(i), is relatively large (which could happen with Internet traffic) then Y_(i) is set to M_(i) (the median) times some constant a a design parameter that depends on the total traffic volume and the target server capacity.

[0394] Time Accumulating Traffic Volume Recognition and “Controlled” Denial of Service

[0395] The effectiveness of volume recognition increases with the time duration along which it is implemented. This is correct since the variance of total data volume generated by a source during a period of duration T decreases in T. For example, it is expected that the average amount of traffic generated by a small source during a period of 1 hour is very small. However, at certain epochs, it is expected that the average amount of traffic generated by the same source during a period of 1 minute can be rather large. (up to 60 times larger than that of the 1 hour average).

[0396] For this reason the following unique recognition and traffic screening mechanism is implemented in illustrated system. For source i, let S_(i)(t) denote the amount traffic generated by the source during the interval (0,t) (where we assume that the attack starts at time 0). We then set at time t: X_(i)(t)=S_(i)(t)/t and apply the above screening mechanism. An alternative way of computing the average is using exponential average of the inter arrival time. Let d_(j) be the inter arrival time between the j-th packet and the (j−1) packet of source I, then the exponential average is T_(i)=(1−a)T_(I−1)+a d_(i).

[0397] This mechanism has the following properties:

[0398] 1. For a small value of t (that is, at the first few seconds of the attack) a sophisticated and powerful attacker might cause some innocent users denial of service. This is due to the fact that the attacker may generate traffic that at the very beginning looks like an innocent client, and thus the attacker is not distinguishable from the innocent client. If at this stage the number of daemons is huge then the illustrated system may block some innocent clients and some attackers in order to ensure that the total volume is below the maximum allowed at the target server. Using this action, for a short period of time, some innocent clients may be denied of service but the illustrated system protects the site from going down (at which point all clients are denied service).

[0399] 2. As t increases more and more malicious sources are identified and blocked and fewer innocent sources are blocked. This is since the malicious sources have posed large amount of accumulated load. Thus as time progresses less and less innocent clients are denied service. In fact, after a relatively short period of time all malicious sources are denied service while the innocent sources receive full regular service.

EXAMPLE

[0400] Consider the traffic volume generated on the Web site of the Nagano server (February 98). It had 11,665,713 requests made over a period of 24 hours by 59,582 clients. This means that a user requests 200 pages on average per session. Assuming uniform distribution of clients over the day, and that a user session spans about 10 minutes, on average, we get that the site supports 400 concurrent users on average. Since traffic is not uniform over the day we assume that the normal traffic reaches 2-3 times the daily average (at least), that is about 1000 concurrent users. For a hacker to overload the site twice the maximum load (i.e., by 100%) it is required to place an extra 1000 concurrent users. Assume that the attacker uses 200 daemons, each of them must generate traffic 5 times as high as that of the normal user, that is, on average 100 pages per minute (instead of 20 pages per minute).

[0401] Now, consider how the illustrated system operates to screen the malicious sources from the innocent ones. One minute after starting to defend, most malicious sources generate about 100 page requests. In contrast, the innocent sources generate about 20 pages; due to statistical fluctuations some of the innocent sources may generate more traffic, say 40 requests, but very few (if any!) will generate about 100 requests. For this reason, after one minute the illustrated system conducts the right screening with the likelihood of mistakenly blocking an innocent user being very small.

[0402] Description of the Protection Mechanism

[0403] The protection and detection would be done in a layered way. For example when we consider a UDP volume attack. At the first step we will try to estimate the total volume of UDP packets. Once we decide that this volume is above a certain threshold, we will spawn a few defenses.

[0404] For example: (1) estimate the volume per destination port (2) the volume per source IP, etc. Assume that we recognize that most of the volume is to port 53 (DNS protocol). In such a case we will invoke defenses which are specific to the DNS. The general idea is that rather than having all the defenses active at all times, invoke the defenses only when it seems like they are relevant.

[0405] Non-Attack Scenarios and Processing of Diverted Traffic

[0406] In addition to, or instead of, filtering malicious traffic for a victim V under a DDoS attack, the guard machines can be employed to protect the victim from overload under any variety of other circumstances, e.g., if the node is simply overwhelmed due to over-popularity or inadequate resources. Such overload conditions can be signaled by the victim in the manner described above as with DDoS attack, e.g., by sending authenticated messages to the NOC whence they are relayed to the guards (SNMP or out of band communication may be used instead).

[0407] The alert message contains the identity of the victim machines, (which includes their IP addresses). At this point the victim enters the “protected” mode.

[0408] Described above are system, devices and methods that achieve the desired objects. Those skilled in the art will appreciate that these are merely embodiments of the invention and that other embodiments, incorporating changes in those depicted here, fall within the scope of the invention. Thus, by way of example, it will be appreciated that guard machines incorporating less, more and/or different element than those describe above in connection with FIGS. 1A and 1B, as well as incorporating less, more and/or different interconnection between such elements, fall within the scope of the invention. By way of further example, it will be appreciated that the invention can be applied to networks (IP and otherwise) other than then the Internet. By way of further example, it will be appreciated that the guard node functionality can be implemented in software, firmware or hardware on any variety of platforms. By way of still further example, it will be appreciated that the invention can be applied for purposes of protecting victims from any overload condition on the Internet (or other network), not just those resulting from DDoS attacks.

[0409] In view of the foregoing, 

What we claim is:
 1. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims on a network, the method comprising the steps of A. with a first set of one or more network elements external to the set of one or more potential victims, diverting to a second set of one or more network elements external to the set of one or more potential victims traffic otherwise destined for the victim, B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim.
 2. A method according to claim 1, wherein the diverting step includes effecting a path of traffic that differs from a path that traffic would otherwise take to the victim.
 3. A method according to claim 1, wherein the filtering step includes detecting any of (i) a traffic pattern that differs from an expected pattern and (ii) traffic volume that differ from expected volume, the detecting step includes determining whether any of the traffic pattern and volume varies statistically significantly.
 4. A method according to claim 1, wherein the filtering step includes detecting suspected malicious traffic.
 5. A method according to claim 4, wherein the detecting step includes detecting packets with spoofed source addresses.
 6. A method according to claim 5, wherein the filtering step includes detecting traffic requiring a selected service from the victim.
 7. A method according to claim 6, wherein the filtering step includes discarding traffic not requiring the selected service from the victim.
 8. A method according to claim 7, wherein the filtering step includes discarding any of UDP and ICMP packet traffic.
 9. A method according to claim 1, wherein the first set and second set include zero, one or more network elements in common.
 10. A method according to claim 1, comprising operating one or more elements of the first set at points on the network around the set of one or more potential victim.
 11. A method according to claim 10, comprising operating one or more elements of the second set any of adjacent to or external to one or more elements of the first set.
 12. A method according to claim 10, comprising selectively activating one or more elements of the first set to divert traffic to divert traffic to one or more elements of the second set.
 13. A method according to claim 12, activating one or more elements of the first sets to divert traffic in response to a distributed denial of service (DDoS) attack, or notification thereof.
 14. A method according to claim 12, comprising selectively activating the one or more elements of the first set by any of (i) declaring a network address of the victim to be close in network distance to one or more elements of the second set, and (ii) declaring the network address of the victim to be far from the victim.
 15. A method according to claim 12, comprising associating victim with first and second addresses, and wherein the filtering step includes discarding traffic received external to an area defined by the points directed to the first address, and passing traffic to the victim traffic received external to an area directed to the second address.
 16. A method according to claim 10, wherein the diverting step includes redirecting traffic using Policy Based Routing.
 17. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim, B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim, C. the filtering step including detecting packets with spoofed source addresses by at least partially processing diverted traffic before selectively passing it, if at all, to the victim.
 18. A method according to claim 17, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.
 19. A method according to claim 18, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.
 20. A method according to claim 18, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.
 21. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim, B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim, C. the filtering step including at least partially processing diverted traffic before selectively passing it, if at all, to the victim.
 22. A method according to claim 21, wherein the step of at least partially processing diverted traffic includes executing a verification protocol.
 23. A method according to claim 22, wherein the step of at least partially processing diverted traffic includes executing a TCP three-way handshake with a source of diverted traffic.
 24. A method according to claim 22, wherein the passing step includes passing to the victim traffic from a source that correctly complies with the handshake protocol.
 25. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim, B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim, C. the filtering step including discarding traffic of selected type.
 26. A method according to claim 25, wherein the filtering step includes discarding any of UDP and ICMP packet traffic.
 27. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of A. with a first set of one or more elements external to the set of one or more potential victims, performing a first filtering of traffic destined for the victim and diverting to a second set of one or more elements external to the set of one or more potential victims at least a portion of that traffic, B. the element(s) of the second set performing a second filtering of traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim
 28. A method according to claim 27, wherein the first filtering step includes checking an address of traffic against a network interface through which it is received.
 29. A method according to claim 28, comprising tracking changes in traffic paths.
 30. A method according to claim 29, comprising sampling traffic that arrives on network interfaces.
 31. A method according to claim 29, comprising querying apparent sources of traffic to validate legitimacy.
 32. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim, B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim, C. the filtering step including identifying any of a source and a type of the overload condition.
 33. A method according to claim 32, wherein the identifying step includes statistically measuring any of the traffic pattern and volume.
 34. A method of responding to an overload condition at a network element (“victim”) in a set of one or more potential victims, the method comprising the steps of A. with a first set of one or more elements external to the set of one or more potential victims, diverting to a second set of one or more elements external to the set of one or more potential victims traffic otherwise destined for the victim, B. the element(s) of the second set filtering traffic diverted in step A (“diverted traffic”) and selectively passing a portion thereof to the victim, C. the filtering step including detecting any of (i) a traffic pattern that differs from an expected pattern and (ii) traffic volume that differ from expected volume.
 35. A method according to claim 34, comprising determining any of a traffic pattern and volume during a period when the victim is not at an overload condition.
 36. A method according to claim 35, wherein the determining step includes at least one of analyzing any of netflow data, server logs, victim traffic, and victim volume, and classifying any of traffic pattern and volume according to types of users that generated it.
 37. A method according to claim 36, wherein the types of users include individuals users, users sharing a host or proxy, web crawlers and monitoring services.
 38. A method according to claim 35, wherein the detecting step includes comparing any of a traffic pattern and volume when the victim is at an overload condition with a respective one of a traffic pattern and volume during a period when the victim is not at an overload condition.
 39. A method according to claim 38, wherein the comparing step includes determining whether any of the traffic pattern and volume varies statistically with respect to an expected traffic pattern and volume, respectively.
 40. A method according to claim 36, wherein the comparing step includes comparing any of traffic volume, port number distribution, periodicity of requests, packet properties, IP geography, and distribution of packet arrival/size.
 41. A method according to claim 34, wherein the detecting step includes determining whether any of the traffic pattern and volume varies statistically significantly.
 42. A method according to claim 34, wherein the detecting step includes determining whether any of the traffic pattern and volume varies statistically significantly from any of an expected pattern and volume, respectively.
 43. A method according to claim 42, comprising determining any of a traffic pattern and volume during a period when the victim is not at an overload condition.
 44. A method according to claim 43, wherein the determining step includes analyzing any of netflow data, server logs, victim traffic, and victim volume.
 45. A method according to claim 44, wherein any of the determining steps include classifying any of traffic pattern and volume according to types of users that generated it.
 46. A network element for use in protecting against an overload condition on a network, the network element comprising: an input for receiving traffic from the network, an filter coupled to the input, the filter selectively blocking traffic originating from a source suspected as potentially causing the overload condition, a statistics module that is coupled to the filter and that identifies traffic statistically indicative of having originated from source potentially causing the overload condition, and an output coupled to the input for selectively passing on to further elements in the network traffic not blocked by the filter.
 47. A network element according to claim 46, comprising a termination detection module that at least participates in determining when the overload condition has ended.
 48. A network element according to claim 46, comprising an antispoofing element that any of authenticates and verifies a source of traffic.
 49. A system for use in protecting against an overload condition on a network, the network element comprising: one or more network elements (“guards”) disposed on the network, each network element having an input for receiving traffic from the network, an filter coupled to the input, the filter selectively blocking traffic originating from a source suspected as potentially causing the overload condition, a statistics module that is coupled to the filter and that identifies traffic statistically indicative of having originated from a source suspected as potentially causing the overload condition, and an output coupled to the input for selectively passing on to further elements in the network traffic not blocked by the filter, one or more further network elements (“diverters”) disposed on the network and in communication with the guards, the further network elements selectively (i) diverting to one or more guards traffic otherwise destined for a still further network element (“victim”) in a set of one or more potential victims on the network.
 50. A system according to claim 49, wherein one or more guards comprises a termination detection module that at least participates in determining when the overload condition has ended.
 51. A system according to claim 49, wherein one or more guards comprises an ingress filter, coupled to the statistical module, that generates and transmits to a further network element on the network rules for blocking traffic on the network.
 52. A network element according to claim 49, comprising an antispoofing element that any of authenticates and verifies a source of traffic. 